Improved bounds for the randomized decision tree Complexity of recursive majority
نویسندگان
چکیده
منابع مشابه
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the δ-two-sided-error randomized decision tree complexity of (1 − 2δ)(5/2), improving the lower bound of (1 − 2δ)(7/3) given by Jayram et al. (STOC ’03). We also state a conjecture which would further improve the lower bound to (1− 2δ)2.54355. ...
متن کاملAn Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority,
We prove that the randomized decision tree complexity of the recursive majority-of-three is Ω(2.55), where d is the depth of the recursion. The proof is by a bottom up induction, which is same in spirit as the one in the proof of Saks and Wigderson in their 1986 paper on the complexity of evaluating game trees. Previous work includes an Ω (
متن کاملImproved bounds for the randomized decision tree complexity
We consider the randomized decision tree complexity of the recursive 3-majority function. We prove a lower bound of (1/2 − δ) · 2.57143 for the two-sided-error randomized decision tree complexity of evaluating height h formulae with error δ ∈ [0, 1/2). This improves the lower bound of (1 − 2δ)(7/3) given by Jayram, Kumar, and Sivakumar (STOC’03), and the one of (1 − 2δ) · 2.55 given by Leonardo...
متن کاملEntropy lower bounds for quantum decision tree complexity
In this note we address the problem of quantum decision tree complexity lower bounds for computing functions that have large image size. We regard the computation as a communication process in which the oracle and the computer exchange messages, each of lg n + 1 bits. Let E(f) be the Shannon entropy of f(X) when X is uniformly random in f ’s domain. Our main result is, to compute any total func...
متن کاملImproved Lower Bounds on the Randomized Complexity of Graph Properties
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite graph property with bipartitions of size n. This improves the previous best bound of(n4/3) due to Hajnal [Haj91]. Our proof works by improving a graph packing lemma used in earlier work, and this improvement in turn s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2015
ISSN: 1042-9832
DOI: 10.1002/rsa.20598